Polymorphic prototiles
نویسندگان
چکیده
منابع مشابه
Combinatorial Aperiodicity of Polyhedral Prototiles∗
The paper studies combinatorial prototiles of locally finite face-to-face tilings of euclidean d-space Ed by convex d-polytopes. A finite set P of prototiles is called combinatorially aperiodic if P admits a locally finite face-to-face tiling by combinatorially equivalent copies of the prototiles in P, but no such tiling with a combinatorial automorphism of infinite order. The paper describes s...
متن کاملPolymorphic cutaneous sarcoidosis: A case report
Sarcoidosis (Besnier-Boeck-Schaumann disease) is a multisystem disease of unknown etiology with various cutaneous presentations. It is characterized by the presence of non-caseating ‘naked’ granulomas in the affected tissue. We report a case of polymorphic cutaneous sarcoid in a 39-year-old immunocompetent male. He was visited at our outpatient department with multiple asymptomatic red colored ...
متن کاملPolymorphic Electronics
This paper introduces the concept of polymorphic electronics (polytronics) –referring to electronics with superimposed built-in functionality. A function change does not require switches/reconfiguration as in traditional approaches. Instead, the change comes from modifications in the characteristics of devices involved in the circuit, in response to controls such as temperature, power supply vo...
متن کاملPolymorphic Quantifier
The generalized quantifier theory does not apply to Japanese quantifiers since: i) the number of NP argument is unspecified; and, ii) quantities are often expressed by predicative adjectives. The word order changes the interpretation, e.g., non-split quantifiers correspond to definite NPs with uniqueness and maximality conditions while split NPs are wide scope indefinites. This paper shows that...
متن کاملPolymorphic Contracts
Manifest contracts track precise properties by refining types with predicates—e.g., {x :Int | x > 0} denotes the positive integers. Contracts and polymorphism make a natural combination: programmers can give strong contracts to abstract types, precisely stating preand post-conditions while hiding implementation details—for example, an abstract type of stacks might specify that the pop operation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1983
ISSN: 0097-3165
DOI: 10.1016/0097-3165(83)90050-x